On the longest path algorithm for reconstructing trees from distance matrices
نویسندگان
چکیده
Culberson and Rudnicki [J.C. Culberson, P. Rudnicki, A fast algorithm for constructing trees from distance matrices, Inform. Process. Lett. 30 (4) (1989) 215–220] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for topological trees. However, this turns out to be false; we show that the algorithm takes (n3/2 √ d ) time in the topological case, giving tight examples. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Learning Graphs via Queries 690 Report
In this report , we explore various aspects of query learning. We focus on learning hidden structures given various queries. In Chapter 1, we consider learning evolutionary trees given distance queries. In Chapter 2 we focus on learning and verifying general graph structures with various queries. In Chapter 3 we are interested in learning circuits with value-injection queries. Chapter 1 is base...
متن کاملReconstruction of graphs based on random walks
The analysis of complex networks is of major interest in various fields of science. In many applications we face the challenge that the exact topology of a network is unknown but we are instead given information about distances within this network. The theoretical approaches to this problem have so far been focusing on the reconstruction of graphs from shortest path distance matrices. Often, ho...
متن کاملComputing the All-Pairs Longest Chain in the Plane
Many problems on sequences and on special kinds of graphs involve the comput.ation of longesl. chains passing point.s in the plane. Given a set 5 of n point.s in the plane. we consider the problem of computing the matrix of longest chain lengths between all pairs of points in 5, and t.he matrix of "parent" point.ers that describes the n longest chain trees. We present a simple sequent.ial algor...
متن کاملEstimating Phylogenies from Lacunose Distance Matrices: Additive is Superior to Ultrametric Estimation
Lapointe and Kirsch (1995) have recently explored the possibility of reconstructing phylogenetic trees from lacunose distance matrices. They have shown that missing cells can be estimated using the ultrametric property of distances, and that reliable trees can be derived from such filled matrices. Here, we extend their work by introducing a novel way to estimate distances based on the four-poin...
متن کاملReconstructing a Bounded-Degree Directed Tree Using Path Queries
We present a randomized algorithm for reconstructing directed rooted trees of n nodes and node degree at most d, by asking at most O(dn log n) path queries. Each path query takes as input an origin node and a target node, and answers whether there is a directed path from the origin to the target. Our algorithm is only a factor of O(d log n) from the informationtheoretic lower bound of Ω(n log n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 101 شماره
صفحات -
تاریخ انتشار 2007